Blind deblurring using coupled convolutional sparse coding regularisation for noisy‐blurry images
نویسندگان
چکیده
منابع مشابه
Blind image deblurring via coupled sparse representation
The problem of blind image deblurring is more challenging than that of non-blind image deblurring, due to the lack of knowledge about the point spread function in the imaging process. In this paper, a learningbased method of estimating blur kernel under the ‘0 regularization sparsity constraint is proposed for blind image deblurring. Specifically, we model the patch-based matching between the b...
متن کاملBlind motion deblurring using multiple images
Recovery of degraded images due to motion blurring is one challenging problem in digital imaging. Most existing techniques on blind deblurring are not capable of removing complex motion blurring from the blurred images of complex structures. One promising approach is to recover the clear image using multiple images captured for the scene. However, it is observed in practice that such a multi-fr...
متن کاملDistributed Convolutional Sparse Coding
We consider the problem of building shift-invariant representations for long signals in the context of distributed processing. We propose an asynchronous algorithm based on coordinate descent called DICOD to efficiently solve the `1minimization problems involved in convolutional sparse coding. This algorithm leverages the weak temporal dependency of the convolution to reduce the interprocess co...
متن کاملBlind Image Deblurring Using Row-Column Sparse Representations
Blind image deblurring is a particularly challenging inverse problem where the blur kernel is unknown and must be estimated en route to recover the deblurred image. The problem is of strong practical relevance since many imaging devices such as cellphone cameras, must rely on deblurring algorithms to yield satisfactory image quality. Despite significant research effort, handling large motions r...
متن کاملScalable Online Convolutional Sparse Coding
Convolutional sparse coding (CSC) improves sparse coding by learning a shift-invariant dictionary from the data. However, existing CSC algorithms operate in the batch mode and are expensive, in terms of both space and time, on large data sets. In this paper, we alleviate these problems by using online learning. The key is a reformulation of the CSC objective so that convolution can be handled e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics Letters
سال: 2018
ISSN: 0013-5194,1350-911X
DOI: 10.1049/el.2018.0901